منابع مشابه
The k-Track Assignment Problem on Partial Orders
The k-track assignment problem is a scheduling problem in which a collection of jobs, represented by intervals, are to be processed by k machines. Two different jobs can be processed by the same machine only if the corresponding intervals do not overlap. We give a compact formulation of the problem and state some polyhedral results for the associated polytope, working in the more general contex...
متن کاملThe Online Stochastic Generalized Assignment Problem
We present a 1 − 1 √ k -competitive algorithm for the online stochastic generalized assignment problem under the assumption that no item takes up more than 1 k fraction of the capacity of any bin. Items arrive online; each item has a value and a size; upon arrival, an item can be placed in a bin or discarded; the objective is to maximize the total value of the placement. Both value and size of ...
متن کاملThe Online Target Date Assignment Problem
Many online problems encountered in real-life involve a two-stage decision process: upon arrival of a new request, an irrevocable first-stage decision (the assignment of a specific resource to the request) must be made immediately, while in a second stage process, certain ”subinstances” (that is, the instances of all requests assigned to a particular resource) can be solved to optimality (offli...
متن کاملOptimal discounts for the online assignment problem
We prove that, for two simple functions drlt, solving the online assignment problem with crl − drlt as the contribution for assigning resource r to task l at time t gives the optimal solution to the corresponding offline assignment problem (provided the optimal offline solution is unique). We call such functions drlt optimal discount functions.
متن کاملA New Parameterless Credal Method to Track-to-Track Assignment Problem
This paper deals with the association step in a multi-sensor multitarget tracking process. A new parameterless credal method for track-to-track assignment is proposed and compared with parameter-dependent methods, namely: the well known Global Nearest Neighbor algorithm (GNN) and a credal method recently proposed by Denœux et al.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2012
ISSN: 0166-218X
DOI: 10.1016/j.dam.2012.01.002